Narrating Formal Proof (Work in Progress)
نویسندگان
چکیده
Building on existing work in proxying interaction with proof assistants, we have previously developed a proof movie. We have now considered the problem of how to augment this movie data structure to support commentary on formal proof development. In this setting, we have studied extracting commentary from an online text by Pierce et al. [11].
منابع مشابه
A Proof Infrastructure for Binary Programs
Establishing properties of binary programs by proof is a desirable goal when the properties of interest are crucial, such as those that arise in safetyand security-critical applications. Practical development of proofs for binary programs requires a substantial infrastructure to disassemble the program, define the machine semantics, and actually undertake the required proofs. At the center of t...
متن کاملFormal Replay of Translation Validation for Highly Optimised C Work in Progress
In previous work [6] we have implemented a translation validation mechanism for checking that a C compiler is adhering to the expected semantics of a verified program. We used this apparatus to check the compilation of the seL4 verified operating system kernel [2] by GCC 4.5.1, with some optimisations disabled. We obtained this result by carefully choosing a problem representation that worked w...
متن کاملA formal proof of fault-tolerant progress
Progress is investigated for a shared-memory distributed system with a form of fault tolerance that allows processes to stop and restart functioning without notiication. A concept of bounded fairness is introduced to formalize bounded delay under the assumption that each family of related processes continuously contains at least one active member. This is a generalization of wait-freedom, and a...
متن کاملFormal Analysis of a Distributed Algorithm for Tracking Progress
Tracking the progress of computations can be both important and delicate in distributed systems. In a recent distributed algorithm for this purpose, each processor maintains a delayed view of the pending work, which is represented in terms of points in virtual time. This paper presents a formal specification of that algorithm in the temporal logic TLA, and describes a mechanically verified corr...
متن کاملFormal Replay of Translation Validation for Highly Optimised C
In previous work [6] we have implemented a translation validation mechanism for checking that a C compiler is adhering to the expected semantics of a verified program. We used this apparatus to check the compilation of the seL4 verified operating system kernel [2] by GCC 4.5.1, with some optimisations disabled. We obtained this result by carefully choosing a problem representation that worked w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 285 شماره
صفحات -
تاریخ انتشار 2012